Newton polytopes of the classical resultant and discriminant
نویسندگان
چکیده
منابع مشابه
Regular triangulations and resultant polytopes
We describe properties of the Resultant polytope of a given set of polynomial equations towards an outputsensitive algorithm for enumerating its vertices. In principle, one has to consider all regular fine mixed subdivisions of the Minkowski sum of the Newton polytopes of the given equations. By the Cayley trick, this is equivalent to computing all regular triangulations of another point set in...
متن کاملResultant and Discriminant of Polynomials
This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results are well-known 19th century mathematics, but I have not investigated the history, and no references are given. 1. Resultant Definition 1.1. Let f(x) = anx n + · · ·+ a0 and g(x) = bmx + · · ·+ b0 be two polynomials of degrees (at most) n and m, respectively, ...
متن کاملOn the Newton Polytope of the Resultant
The study of Newton polytopes of resultants and discriminants has its orgin in the work of Gelfand, Kapranov, and Zelevinsky on generalized hypergeometric functions (see e.g., [8]). Central to this theory is the notion of the A-discriminant AA, which is the discriminant of a Laurent polynomial with specified support set A (see [6, 7]). Two main results of Gelfand, Kapranov, and Zelevinsky are c...
متن کاملThe Univariate Discriminant via the Sylvester Resultant
Remark 1.2 The Fundamental Theorem of Algebra enters in the very last inequality: the fact that having d distinct roots implies that Res(d,d−1)(f, f ) 6= 0. Later we will see a refinement of the above theorem giving a positive lower bound even when Res(d,d−1)(f, f )=0. ⋄ A key result we’ll need is the following algebraic identity. Lemma 1.3 Following the notation of Theorem 1.1, we have Res(d,d...
متن کاملNewton Polytopes and Witness Sets
We present two algorithms that compute the Newton polytope of a polynomial f defining a hypersurface H in Cn using numerical computation. The first algorithm assumes that we may only compute values of f—this may occur if f is given as a straightline program, as a determinant, or as an oracle. The second algorithm assumes that H is represented numerically via a witness set. That is, it computes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1990
ISSN: 0001-8708
DOI: 10.1016/0001-8708(90)90047-q